Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs
نویسندگان
چکیده
We show that for constraint satisfaction problems (CSPs), weakly exponential size linear programming relaxations are as powerful the explicit program described by $n^{\Omega(1)}$-rounds o...
منابع مشابه
Approximating CSPs Using LP Relaxation
This paper studies how well the standard LP relaxation ap-proximates a k-ary constraint satisfaction problem (CSP) on label set[L]. We show that, assuming the Unique Games Conjecture, it achievesan approximation within O(k · logL) of the optimal approximation fac-tor. In particular we prove the following hardness result: let I be a k-aryCSP on label set [L] with constraints ...
متن کاملCompact vs. exponential-size LP relaxations
In this paper we introduce by means of examples a new technique for formulating compact (i.e. polynomial-size) LP relaxations in place of exponential-size models requiring separation algorithms. In the same vein as a celebrated theorem by Grotschel, Lovasz and Schrijver, we state the equivalence of compact separation and compact optimization. Among the examples used to illustrate our technique,...
متن کاملOne-dimensional relaxations and LP bounds for orthogonal packing
We consider the feasibility problem in d-dimensional orthogonal packing (d ≥ 2), called Orthogonal Packing Problem (OPP): given a set of ddimensional rectangular items, decide whether all of them can be orthogonally packed in the given rectangular container without item rotation. We review two kinds of 1D relaxations of OPP. The first kind is non-preemptive cumulative-resource scheduling, equiv...
متن کاملLower Bounds for Approximating the Matching Polytope
We prove that any extended formulation that approximates the matching polytope on nvertex graphs up to a factor of (1 + ε) for any 2 n ≤ ε ≤ 1 must have at least ( n α/ε ) defining inequalities where 0 < α < 1 is an absolute constant. This is tight as exhibited by the (1 + ε) approximating linear program obtained by dropping the odd set constraints of size larger than (1 + ε)/ε from the descrip...
متن کاملStreaming Lower Bounds for Approximating MAX-CUT
We consider the problem of estimating the value of max cut in a graph in the streaming model of computation. At one extreme, there is a trivial 2-approximation for this problem that uses only O(log n) space, namely, count the number of edges and output half of this value as the estimate for max cut value. On the other extreme, if one allows Õ(n) space, then a near-optimal solution to the max cu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2021
ISSN: ['1095-7111', '0097-5397']
DOI: https://doi.org/10.1137/17m1152966